Abstract Normative Systems: Semantics and Proof Theory
نویسندگان
چکیده
Normative Systems: Semantics and Proof Theory Silvano Colombo Tosatto SnT, University of Luxembourg Luxembourg Guido Boella University of Turin Italy Leendert van der Torre University of Luxembourg Luxembourg Serena Villata INRIA France
منابع مشابه
Proof Theory, Semantics and Algebra for Normative Systems
This paper reports correspondence results between input/ output logic and the theory of joining-systems. The results have the form: every norm (a, x) is logically derivable from a set of norms G if and only if it is in the space of norms algebraically generated by G.
متن کاملPossible World Semantics for Defeasible Deontic Logic
Defeasible Deontic Logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible lo...
متن کاملFunctorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملMonads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [Lü96], this semantics was used to give a purely categorical proof of the modularity of confluence for the disjoint union of term rewriting systems. This paper provides further support for monadic semantics of rewriting by giving a categorica...
متن کاملFormalizing natural deduction with assumption bases
We introduce NDL, a new formalization of Fitch-style natural deduction based on the abstraction of assumption bases. NDL proofs tend to be readable, writable, concise, and can be checked very efficiently. We present the abstract syntax of NDL, followed by two different kinds of formal semantics: evaluation and denotational. We then relate the two semantics and show how proof checking becomes ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012